On Computing the Topological Entropy of One-sided Cellular Automata
نویسنده
چکیده
منابع مشابه
Conjugacy of One-Dimensional One-Sided Cellular Automata is Undecidable
Two cellular automata are strongly conjugate if there exists a shiftcommuting conjugacy between them. We prove that the following two sets of pairs (F,G) of one-dimensional one-sided cellular automata over a full shift are recursively inseparable: (i) pairs where F has strictly larger topological entropy than G, and (ii) pairs that are strongly conjugate and have zero topological entropy. Becau...
متن کاملThe Complexity of Permutive Cellular Automata
This paper studies cellular automata in two aspects: Ergodic and topological behavior. For ergodic aspect, the formulae of measure-theoretic entropy, topological entropy and topological pressure are given in closed forms and Parry measure is demonstrated to be an equilibrium measure for some potential function. For topological aspect, an example is examined to show that the exhibition of snap-b...
متن کاملOn Computing the Entropy of Cellular Automata
We study the topological entropy of a particular class of dynamical systems: cellular automata. The topological entropy of a dynamical system (X; F) is a measure of the complexity of the dynamics of F over the space X . The problem of computing (or even approximating) the topological entropy of a given cellular automata is algorithmically undecidable (Ergodic Theory Dynamical Systems 12 (1992) ...
متن کاملRow Subshifts and Topological Entropy of Cellular Automata
Cellular Automata (CA) are symbolic dynamical systems often used in computer science as models of complex systems [9]. The topological entropy is often referred to as a measure of the complexity of a dynamical system [1]. The topological entropy of a CA (AZ, F ) is defined in terms of the entropy of its column subshifts Σk [4], H(F ) = limk→∞ H(Σk) k . Here we address the following question: is...
متن کاملEntropy and Applications of Cellular Automata
In this paper I will provide an introduction to the theory of cellular automata and review a paper by Michele D’amico, Giovanni Manzini, and Luciano Margara [3], On computing the entropy of cellular automata, in which the authors study the topological entropy of cellular automata. The main problems addressed are proving a closed form for the topological entropy of D-dimensional linear cellular ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Cellular Automata
دوره 2 شماره
صفحات -
تاریخ انتشار 2007